1153A - Serval and Bus - CodeForces Solution

brute force math *1000

Please click on ads to support us..

Python Code: 

n,t=map(int,input().split())
ans=[]
for i in range(n):
    t1,d=map(int,input().split())
    if t1>=t:
        ans.append((t1-t,i+1))
    else:
        ans.append((((t-t1-1)//d+1)*d+t1-t,i+1))
print(sorted(ans)[0][1])

C++ Code: 

#include <bits/stdc++.h>
using namespace std;
int main(){
    int n, t;
    scanf("%d %d", &n, &t);
    pair<int, int> l[n];
    for(int i = 0; i < n; i++){
        scanf("%d %d", &l[i].first, &l[i].second);
    }
    auto cal = [&](int i){
        auto [x, v] = l[i];
        if(x > t) return x;
        else{
            return x + ((t - x + v - 1) / v) * v;
        }
    };
    int i = 0;
    for(int j = 1; j < n; j++){
        if(cal(j) < cal(i)){
            i = j;
        }
    }
    printf("%d\n", i + 1);
    return 0;
}


Comments

Submit
0 Comments
More Questions

349A - Cinema Line
47A - Triangular numbers
1516B - AGAGA XOOORRR
1515A - Phoenix and Gold
1515B - Phoenix and Puzzle
155A - I_love_username
49A - Sleuth
1541A - Pretty Permutations
1632C - Strange Test
673A - Bear and Game
276A - Lunch Rush
1205A - Almost Equal
1020B - Badge
1353A - Most Unstable Array
770A - New Password
1646B - Quality vs Quantity
80A - Panoramix's Prediction
1354B - Ternary String
122B - Lucky Substring
266B - Queue at the School
1490A - Dense Array
1650B - DIV + MOD
1549B - Gregor and the Pawn Game
553A - Kyoya and Colored Balls
1364A - XXXXX
1499B - Binary Removals
1569C - Jury Meeting
108A - Palindromic Times
46A - Ball Game
114A - Cifera